Experimenting with Revisits in Game Tree Search
نویسنده
چکیده
The oldest known game tree search algorithm Alpha-Beta is still the most popular one. All other algorithms in this area fall short of Alpha-Beta in one or more of the following three desired characteristics high pruning power, low storage requirement and low execution time. This paper discusses how revisit of nodes can be used effectively in game tree search. A few strategies of introducing revisits in game tree search are presented. It is demonstrated that for any shape and ordering of the game tree to be searched, there always exists one strategy that, on an average, consistently evaluates less number of terminals than Alpha-Beta in comparable memory and time.
منابع مشابه
Creating an Upper-Confidence-Tree Program for Havannah
Monte-Carlo Tree Search and Upper Confidence Bounds provided huge improvements in computer-Go. In this paper, we test the generality of the approach by experimenting on another game, Havannah, which is known for being especially difficult for computers. We show that the same results hold, with slight differences related to the absence of clearly known patterns for the game of Havannah, in spite...
متن کاملMultiple Overlapping Tiles for Contextual Monte Carlo Tree Search
Monte Carlo Tree Search is a recent algorithm that achieves more and more successes in various domains. We propose an improvement of the Monte Carlo part of the algorithm by modifying the simulations depending on the context. The modification is based on a reward function learned on a tiling of the space of Monte Carlo simulations. The tiling is done by regrouping the Monte Carlo simulations wh...
متن کاملVoltage Sag Compensation with DVR in Power Distribution System Based on Improved Cuckoo Search Tree-Fuzzy Rule Based Classifier Algorithm
A new technique presents to improve the performance of dynamic voltage restorer (DVR) for voltage sag mitigation. This control scheme is based on cuckoo search algorithm with tree fuzzy rule based classifier (CSA-TFRC). CSA is used for optimizing the output of TFRC so the classification output of the network is enhanced. While, the combination of cuckoo search algorithm, fuzzy and decision tree...
متن کاملImplementation of Game Tree Search Method by using NSL
This paper describes about hardware game tree search method of Blokus Duo. As algorithm of the game tree search method, we apply an evaluation function of sphere of influence. The game tree search method of hardware is implemented on FPGA. An implementation of the game tree search method by the hardware shows the effect which is easily of the operating speed improving.
متن کاملAPHID: Asynchronous Parallel Game-Tree Search
Most parallel game-tree search approaches use synchronous methods, where the work is concentrated within a specific part of the tree, or at a given search depth. This article shows that asynchronous game-tree search algorithms can be as efficient as or better than synchronous methods in determining the minimax value. APHID, a new asynchronous parallel game-tree search algorithm, is presented. A...
متن کامل